Chemistry problems (Sienko, M. J.)

RANDOMIZED eO ( M ( jV j ) ) ALGORITHMS FOR PROBLEMS

A randomized (Las Vegas) algorithm is given for nding the Gallai-Edmonds decomposition of a graph. Let n denote the number of vertices, and let M(n) denote the number of arithmetic operations for multiplying two n n matrices. The sequential running time (i.e., number of bit operations) is within a poly-logarithmic factor of M(n). The parallel complexity is O((log n) 2) parallel time using a num...

RANDOMIZED eO ( M ( jV j ) ) ALGORITHMS FOR PROBLEMS INMATCHING

A randomized (Las Vegas) algorithm is given for nding the Gallai-Edmonds decomposition of a graph. Let n denote the number of vertices, and let M(n) denote the number of arithmetic operations for multiplying two n n matrices. The sequential running time (i.e., number of bit operations) is within a poly-logarithmic factor of M(n). The parallel complexity is O((log n) 2) parallel time using a num...

Swinkels , J . M . and Lam , T . J . G . M .

26

J. M. Rattray

The death of Dr. John Moysey Rattray on November 4th, aged 65, causes a gap among our older medical colleagues ; for although he had retired from his practice at Frome, he retained his untiring interest in all that concerned the profession he had served so well, and that cheerful, bright, conversational power that rendered him always a delightful companion, and made one forget that he was no lo...

How , M . J . , Christy , J . H . , Temple , S . E . , Hemmi , J . M . , Justin Marshall , N .